Minimizing expected makespan in flowshop with on condition based maintenance constraint by integrating heuristics and simulation

نویسندگان

  • E. Safari
  • S. J. Sadjadi
چکیده

The availability of the machine is one of the most important assumptions on many scheduling problems under any situation. However, in most actual life manufacturing settings a machine can be unavailable for many reasons, such as unforeseen scheduled preventive. In this paper, we study scheduling flowshops problem under ’condition based’ maintenance constraints to minimize the expected makespan using simulation to tackle the randomness of the problem at hand. Heuristics and meta hueristics is used to tackle such an NP-hard problem. It is additionally supposed that machines suffer form degradation due to shocks, thus preventive maintenance should be done on machines. Furthermore, it is assumed that the degradation value of machine is known at inspection time. Overall, three adaptations of existing metaheuristic and hueristics methods are evaluated for the integration of preventive maintenance and they are applied to a set of 1080 instances. The preliminary results manifest the superiority of genetic algorithm over others.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Reliability based Modelling and Optimization of an Integrated Production and Preventive Maintenance Activities in Flowshop Scheduling Problem

Traditional scheduling problems with the batch processing machines (BPM) assume that machines are continuously available, and no time is needed for their preventive maintenance (PM). In this paper, we study a realistic variant of flowshop scheduling which integrates flow shop batch processing machines (FBPM) and preventive maintenance for minimizing the makespan. In order to tackle the given pr...

متن کامل

A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown

One of the most important assumptions in production scheduling is that the machines are permanently available without any breakdown. In the real world of scheduling, machines can be made unavailable due to various reasons such as preventive maintenance and unpredicted breakdown. In this paper, we explore flowshop configuration under the assumption of condition-based maintenance to minimize expe...

متن کامل

Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

متن کامل

Minimizing Makespan and Workstation Utilization in a Flowshop with Operations Flexibility

Operations flexibility refers to production environments where there are more tasks than workstations and any task can be assigned to any workstation. This article investigates the advantages of operations flexibility in a flowshop when the objectives are to minimize the makespan and workstation utilization. The proposed heuristic framework consists of two phases, allocation of operations to wo...

متن کامل

Diversified Particle Swarm Optimization for Hybrid Flowshop Scheduling

The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009